Linearly ordered sets with only one operator have the amalgamation property
نویسندگان
چکیده
The class of linearly ordered sets with one order preserving unary operation has the Strong Amalgamation Property (SAP). strict AP but not SAP. two operations does have AP. For every set F, an F-indexed family automorphisms Corresponding results are proved in case reversing operations. Various subclasses above classes considered and some model-theoretical consequences presented.
منابع مشابه
Automorphisms of Powers of Linearly Ordered Sets
Let I = ([0; 1];_;^; 0; 1), where _ and ^ are max and min, respectively. This algebra is the basic building block of fuzzy set theory and logic. Likewise, the algebra I = ([0; 1];_;^; 0; 1), where [0; 1] = f(a; b) : a; b 2 [0; 1], a bg, _, ^ are given coordinate-wise, and 0 and 1 are the bounds on [0; 1], is the relevant algebra for interval-valued fuzzy set theory and logic. A good share of th...
متن کاملThe fixed point property for ordered sets
An ordered set P has the fixed point property iff every order-preserving self-map of P has a fixed point. This paper traces the chronological development of research on this property, including most recent developments and open questions. Mathematics Subject Classification 06A06
متن کاملA Simple Algorithm for Merging Two Disjoint Linearly-Ordered Sets
In this paper we present a new algorithm for merging two linearly ordered sets which requires substantially fewer comparisons than the commonly used tape merge or binary insertion algorithms. Bounds on the difference between the number of comparisons required by this algorithm and the information theory lower bounds are derived. Results from a computer implementation of the new algorithm are gi...
متن کاملPattern classes of permutations via bijections between linearly ordered sets
A pattern class is a set of permutations closed under pattern involvement or, equivalently, defined by certain subsequence avoidance conditions. Any pattern class X which is atomic, i.e. indecomposable as a union of proper subclasses, has a representation as the set of subpermutations of a bijection between two countable (or finite) linearly ordered sets A and B. Concentrating on the situation ...
متن کاملExtensions of ordered sets having the finite cutset property
Let P be an ordered set. P is said to have the finite cutset property if for every x in P there is a finite set F of elements which are noncomparable to x such that every maximal chain in P meets {x} t.J F. It is well known that this property is equivalent to the space of maximal chains of P being compact. We consider the following question: Which ordered sets P can be embedded in an ordered se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2021
ISSN: ['0168-0072', '1873-2461']
DOI: https://doi.org/10.1016/j.apal.2021.103015